Incomplete Multiview Clustering via Cross-View Relation Transfer

نویسندگان

چکیده

In this paper, we consider the problem of multi-view clustering on incomplete views. Compared with complete clustering, view-missing increases difficulty learning common representations from different To address challenge, propose a novel framework, which incorporates cross-view relation transfer and fusion learning. Specifically, based consistency existing in data, devise transfer-based completion module, transfers known similar inter-instance relationships to missing view infers data via graph networks transferred relationship graph. Then view-specific encoders are designed extract recovered an attention-based layer is introduced obtain representation. Moreover, reduce impact error caused by inconsistency between views better structure, joint optimize recovery simultaneously. Extensive experiments conducted several real datasets demonstrate effectiveness proposed method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiview Clustering with Incomplete Views

Multiview clustering algorithms allow leveraging information from multiple views of the data and therefore lead to improved clustering. A number of kernel based multiview clustering algorithms work by using the kernel matrices defined on the different views of the data. However, these algorithms assume availability of features from all the views of each example, i.e., assume that the kernel mat...

متن کامل

Consensus Kernel K-Means Clustering for Incomplete Multiview Data

Multiview clustering aims to improve clustering performance through optimal integration of information from multiple views. Though demonstrating promising performance in various applications, existing multiview clustering algorithms cannot effectively handle the view's incompleteness. Recently, one pioneering work was proposed that handled this issue by integrating multiview clustering and impu...

متن کامل

Clustering View-Segmented Documents via Tensor Modeling

We propose a clustering framework for view-segmented documents, i.e., relatively long documents made up of smaller fragments that can be provided according to a target set of views or aspects. The framework is designed to exploit a view-based document segmentation into a third-order tensor model, whose decomposition result would enable any standard document clustering algorithm to better reflec...

متن کامل

Domain Transfer via Analogy 1 Running head: DOMAIN TRANSFER VIA CROSS-DOMAIN ANALOGY Domain Transfer via Cross-Domain Analogy

Analogical learning has long been seen as a powerful way of extending the reach of one‟s knowledge. We present the domain transfer via analogy (DTA) method for learning new domain theories via cross-domain analogy. Our model uses analogies between pairs of textbook example problems, or worked solutions, to create a domain mapping between a familiar and a new domain. This mapping allows us to in...

متن کامل

View Synthesis for Multiview Video Compression

We consider multiview video compression: the problem of jointly compressing multiple views of a scene recorded by different cameras. To take advantage of the correlation between views, we compare the performance of disparity compensated view prediction and view synthesis prediction to independent coding of all views using H.264/AVC. The proposed view synthesis prediction technique works by firs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Circuits and Systems for Video Technology

سال: 2023

ISSN: ['1051-8215', '1558-2205']

DOI: https://doi.org/10.1109/tcsvt.2022.3201822